A problem about set translations on the real line
نویسندگان
چکیده
منابع مشابه
On Translations of Subsets of the Real Line
In this paper we discuss various questions connected with translations of subsets of the real line. Most of these questions originate from W. Sierpiński. We discuss the number of translations a single subset of the reals may have. Later we discuss almost invariant subsets of Abelian groups.
متن کاملSome Results about Set-Valued Complementarity Problem
This paper is devoted to consider the notions of complementary problem (CP) and set-valued complementary problem (SVCP). The set-valued complementary problem is compared with the classical single-valued complementary problem. Also, the solution set of the set-valued complementary problem is characterized. Our results illustrated by some examples. This paper is devoted to co...
متن کاملOn the P-coverage Problem on the Real Line
In this paper we consider the p-coverage problem on the real line. We first give a detailed description of an algorithm to solve the coverage problem without the upper bound p on the number of open facilities. Then we analyze how the structure of the optimal solution changes if the setup costs of the facilities are all decreased by the same amount. This result is used to develop a parametric ap...
متن کاملAbout Herman Auerbach’s Problem on Factors of Real Polynomials with Connected Zero Set Complement
denote a polynomial with real coefficients. Consider the set of points defined by the equation P (x 1 ,. .. , x n) = 0. A necessary and sufficient condition for this set not to cut the Euclidean (real) space is: All the irreducible factors of the polynomial P in the real domain should be always nonnegative or always nonpositive. We will interpret " not to cut " to mean that the real zero set of...
متن کاملCombinatorial theorems about embedding trees on the real line
We consider the combinatorial problem of embedding a tree metric into the real line with low distortion. For two special families of trees — the family of complete binary trees and the family of subdivided stars — we provide embeddings whose distortion is provably optimal, up to a constant factor. We also prove that the optimal distortion of a linear embedding of a tree can be arbitrarily low o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Colloquium Mathematicum
سال: 1982
ISSN: 0010-1354,1730-6302
DOI: 10.4064/cm-46-2-209-214